Multi-Round Message Scheduling for Fast GNSS Packet Broadcasting

Global navigation satellite systems (GNSSs) may transmit data to provide additional services. Since the resources reserved for these are typically fixed and message rate is low, we propose split long messages into shorter packets properly schedule their transmission from entire constellation of satellites. Considering an efficient (useful example search rescue messages), aim at scheduling on satellites multiple rounds with two objectives: either a) minimization maximum latency among all receivers, or b) maximization average received per round. We first derive bounds performance any GNSS single multi-round solution, which proposed solutions based. Then introduce problems that turn out be integer linear programming (ILP) problems. Lastly, assess performance, showing our solution minimizes latency, while targeting outperforms existing literature solutions.